package com.faiz.example;

public class InclinedVisit {

    public static void main(String[] args) {
        int[][] dp = {{1, 2, 3}, {4, 5, 6}};
        int n = 3;
        for (int l = 1; l <= n; l++) {
            for (int i = 0; i <= n - l; i++) {
                int j = l + i - 1;
                // 计算 dp[i][j]
                System.out.print(dp[i][j]);
            }
            System.out.println();
        }
    }

    // 遍历方向
}
